Unsupervised Learning Based Distributed Detection of Global Anomalies.

Classification of LIBS Protein Spectra Using Multilayer Perceptrons.

Classification of LIBS Protein Spectra Using Multilayer Perceptrons.

Detection of moving objects using incremental connectivity outlier factor algorithm.

Theoretically Optimal Distributed Anomaly Detection.

Incremental Connectivity%2DBased Outlier Factor Algorithm.

An adaptive partitioning approach for mining discriminant regions in 3D image data.

Incremental Local Outlier Detection for Data Streams.
Abstract. Outlier detection has recently become an important problem in many industrial and financial applications. This problem is further complicated by the fact that in many cases, outliers have to be detected from data streams that arrive at an enormous pace. In this paper, an incremental LOF (Local Outlier Factor) algorithm, appropriate for detecting outliers in data streams, is proposed. The proposed incremental LOF algorithm provides equivalent detection performance as the iterated static LOF algorithm (applied after insertion of each data record), while requiring significantly less computational time. In addition, the incremental LOF algorithm also dynamically updates the profiles of data points. This is a very important property, since data profiles may change over time. The paper provides theoretical evidence that insertion of a new data point as well as deletion of an old data point influence only limited number of their closest neighbors and thus the number of updates per such insertion/deletion does not depend on the total number of points N in the data set. Our experiments performed on several simulated and real life data sets have demonstrated that the proposed incremental LOF algorithm is computationally efficient, while at the same time very successful in detecting outliers and changes of distributional behavior in various data stream applications. I.
Outlier Detection with Kernel Density Functions.

Resource and Application Models for Advanced Grid Schedulers

Measuring and Monitoring Grid Resource Utilisation

Measuring and Monitoring Grid Resource Utilisation

A Study of Grid Applications Scheduling Perspective

Self%2DOrganising management of Grid environments

Enabling Adaptive Grid Scheduling and Resource Management

Managing Uncertainty A Case for Probabilistic Grid Scheduling

Feature bagging for outlier detection.
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in very large, high dimensional and noisy databases is proposed. It combines results from multiple outlier detection algorithms that are applied using different set of features. Every outlier detection algorithm uses a small subset of features that are randomly selected from the original feature set. As a result, each outlier detector identifies different outliers, and thus assigns to all data records outlier scores that correspond to their probability of being outliers. The outlier scores computed by the individual outlier detection algorithms are then combined in order to find the better quality outliers. Experiments performed on several synthetic and real life data sets show that the proposed methods for combining outputs from multiple outlier detection algorithms provide non-trivial improvements over the base algorithm.
Effective localized regression for damage detection in large complex mechanical structures.

Extraction of Discriminative Functional MRI Activation Patterns and an Application to Alzheimer%27s Disease.
We propose a novel Dynamic Recursive Partitioning approach for  discovering discriminative patterns of functional MRI activation. The goal is to  efficiently identify spatial regions that are associated with non-spatial variables  through adaptive recursive partitioning of the 3D space into a number of hyperrectangles  utilizing statistical tests. As a case study, we analyze fMRI datasets  obtained from a study that explores neuroanatomical correlates of semantic  processing in Alzheimer&#039;s disease. We seek to discover brain activation areas  that discriminate controls from patients. We evaluate the results by presenting  classification experiments that utilize information extracted from these regions.
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering.
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarchical clustering approach. The proposed approach consists of three phases applied recursively: partitioning, localization and prediction. In the partitioning step, similar target variables are grouped together by a clustering algorithm. In the localization step, a classification model is used to predict which group of target variables is of particular interest. If the identified group of target variables still contains a large number of target variables, the partitioning and localization steps are repeated recursively and the identified group is further split into subgroups with more similar target variables. When the number of target variables per identified subgroup is sufficiently small, the third step predicts target variables using localized prediction models built from only those data records that correspond to the particular subgroup. Experiments performed on the problem of damage prediction in complex mechanical structures indicate that our proposed hierarchical approach is computationally more efficient and more accurate than straightforward methods of predicting each target variable individually or simultaneously using global prediction models. 1.
SMOTEBoost Improving Prediction of the Minority Class in Boosting.
Abstract. Many real world data mining applications involve learning from imbalanced data sets, where the particular events of interest may be very few when compared to the other classes. Learning from data sets that contain rare events usually produces biased classifiers that have a higher predictive accuracy over the majority class(es), but poorer predictive accuracy over the minority class of interest. SMOTE (Synthetic Minority Over-sampling Technique) is a recent approach that is specifically designed for learning with minority classes. Boosting is a promising ensemble-based learning algorithm that can improve the classification performance of any weak classifier. This paper presents a novel approach for learning from rare classes, based on a combination of the SMOTE algorithm and the boosting procedure. Unlike standard boosting where all misclassified examples are given equal weights, the novel SMOTEBoost approach creates synthetic examples from the minority class, thus indirectly changing the updating weights and compensating for skewed distributions. The SMOTEBoost algorithm applied to several highly and moderately imbalanced data sets shows improvement in prediction performance on the rare class compared to standard boosting and to the SMOTE algorithm used with a single classifier. 1.
A Comparative Study of Anomaly Detection Schemes in Network Intrusion Detection.
Abstract. Intrusion detection corresponds to a suite of techniques that can be used to identify attacks against computers and network infrastructures. Anomaly detection is a key element of intrusion detection systems in which perturbations of normal behavior suggest the presence of intentionally or unintentionally induced attacks, faults, defects, etc. Several recently developed anomaly and outlier detection schemes have been proposed for detecting novel attacks whose nature is unknown. To benefit the anomaly detection framework, a procedure for extracting additional useful features is also implemented. In addition, evaluation of anomaly detection algorithms is performed using standard metrics as well as specific metrics that are especially suitable in detecting intrusions that involve multiple network connections. The detailed comparison of anomaly detection algorithms applied to DARPA 1998 Intrusion Detection Evaluation Data demonstrate that depending on the attack type some anomaly detection schemes are more successful in detecting novel anomalies than others. However, during the past few months the most prominent techniques have also been applied to real network data, and they have been very successful in automatically identifying several novel intrusions, which were at the same time reported by CERT (Computer Emergency Response Team/Coordination Center) for additional investigation, since state-of-the-art intrusion detection techniques could not detect them. 1.
Boosting Algorithms for Parallel and Distributed Learning.

Knowledge Discovery in Multiple Spatial Databases.
Many large-scale spatial data analysis problems involve an  investigation of relationships in heterogeneous databases. In such situations,  instead of making predictions uniformly across entire spatial data sets, in a  previous study we used clustering for identifying similar spatial regions and  then constructed local regression models describing the relationship between  data characteristics and the target value inside each cluster. This approach  requires all the data to be resident on a central machine, and it is not  applicable when a large volume of spatial data is distributed at multiple sites.
The distributed boosting algorithm.
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneous databases that cannot be merged at a single location. Our distributed boosting algorithm can also be used as a parallel classification technique, where a massive database that cannot fit into main computer memory is partitioned into disjoint subsets for a more efficient analysis. In the proposed method, at each boosting round the classifiers are first learned from disjoint datasets and then exchanged amongst the sites. Finally the classifiers are combined into a weighted voting ensemble on each disjoint data set. The ensemble that is applied to an unseen test set represents an ensemble of ensembles built on all distributed sites. In experiments performed on four large data sets the proposed distributed boosting method achieved classification accuracy comparable or even slightly better than the standard boosting algorithm while requiring less memory and less computational time. In addition, the communication overhead of the distributed boosting algorithm is very small making it a viable alternative to the standard boosting for large-scale databases.
Data Reduction Using Multiple Models Integration.
Large amount of available information does not necessarily imply  that induction algorithms must use all this information. Samples often provide  the same accuracy with less computational cost. We propose several effective  techniques based on the idea of progressive sampling when progressively larger  samples are used for training as long as model accuracy improves. Our sampling  procedures combine all the models constructed on previously considered  data samples. In addition to random sampling, controllable sampling based on  the boosting algorithm is proposed, where the models are combined using a  weighted voting. To improve model accuracy, an effective pruning technique  for inaccurate models is also employed. Finally, a novel sampling procedure for  spatial data domains is proposed, where the data examples are drawn not only  according to the performance of previous models, but also according to the spatial  correlation of data. Experiments performed on several data sets showed that  the proposed sampling procedures outperformed standard progressive sampling  in both the achieved accuracy and the level of data reduction.
Adaptive boosting techniques in heterogeneous and spatial databases.
Combining multiple classifiers is an effective technique for improving classification accuracy by reducing the variance through manipulating the training data distributions. In many large-scale data analysis problems involving heterogeneous databases with attribute instability, however, standard boosting methods do not improve local classifiers (e.g. k-nearest neighbors) due to their low sensitivity to data perturbation. Here, we propose an adaptive attribute boosting technique to coalesce multiple local classifiers each using different relevant attribute information. To reduce the computational costs of k-nearest neighbor (k-NN) classifiers, a novel fast k-NN algorithm is designed. We show that the proposed combining technique is also beneficial when boosting global classifiers like neural networks and decision trees. In addition, a modification of the boosting method is developed for heterogeneous spatial databases with unstable driving attributes by drawing spatial blocks of data at each boosting round. Finally, when heterogeneous data sets contain several homogeneous data distributions, we propose a new technique of boosting specialized classifiers, where instead of a single global classifier for each boosting round, there are specialized classifiers responsible for each homogeneous region. The number of regions is identified through a clustering algorithm performed at each boosting iteration. New boosting methods applied to synthetic spatial data and real life spatial data show improvements in prediction accuracy for both local and global classifiers when unstable driving attributes and heterogeneity are present in the data. In addition, boosting specialized experts significantly reduces the number of iterations needed for achieving the maximal prediction accurac...
Distributed clustering and local regression for knowledge discovery in multiple spatial databases.
Many large-scale spatial data analysis problems involve an  investigation of relationships in heterogeneous databases. In such situations,  instead of making predictions uniformly across entire spatial data sets, in a  previous study we used clustering for identifying similar spatial regions and  then constructed local regression models describing the relationship between  data characteristics and the target value inside each cluster. This approach  requires all the data to be resident on a central machine, and it is not  applicable when a large volume of spatial data is distributed at multiple sites.
A Software System for Spatial Data Analysis and Modeling.
Advances in geographical information systems (GIS) and supporting data collection technology has resulted in the rapid collection of a huge amount of spatial data. However, known data mining techniques are unable to fully extract knowledge from high dimensional data in large spatial databases, while data analysis in typical knowledge discovery software is limited to non-spatial data. Therefore, the aim of the software system for spatial data analysis and modeling (SDAM) presented in this article was to provide flexible machine learning tools for supporting an interactive knowledge discovery process in large centralized or distributed spatial databases. SDAM offers an integrated tool for rapid software development for data analysis professionals as well as systematic experimentation by spatial domain experts without prior training in machine learning or statistics. When the data are physically dispersed over multiple geographic locations, the SDAM system allows data analysis and modeling operations to be conducted at distributed sites by exchanging control and knowledge rather than raw data through slow network connections.
Adaptive Boosting for Spatial Functions with Unstable Driving Attributes.
Combining multiple global models (e.g. back-propagation based  neural networks) is an effective technique for improving classification accuracy  by reducing a variance through manipulating training data distributions. Standard
